A note on perfect Lucky k-colourable graphs
نویسندگان
چکیده
منابع مشابه
A Note on Uniquely H-colourable Graphs
For a graph H, we compare two notions of uniquely H-colourable graphs, where one is defined via automorphisms, the second by vertex partitions. We prove that the two notions of uniquely H-colourable are not identical for all H, and we give a condition for when they are identical. The condition is related to the first homomorphism theorem from algebra.
متن کاملThree-colourable perfect graphs without even pairs
We still do not know how to construct the “most general” perfect graph, not even the most general three-colourable perfect graph. But constructing all perfect graphs with no even pairs seems easier, and here we make a start on it; we construct all three-connected three-colourable perfect graphs without even pairs and without clique cutsets. They are all either line graphs of bipartite graphs, o...
متن کاملOn clique-perfect and K-perfect graphs
A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph H of G. When equality holds for every clique subgraph of G, the graph is c–clique-perfect. A graph G is K-perfect when its clique graph K(G) is perfect. In this work, relations are described among the classes of perfec...
متن کاملGrid drawings of k-colourable graphs
Let G = (V,E) be a graph. All graphs considered are simple, £nite and undirected. A grid drawing of G is an injective mapping θ : V → Z such that for all edges vw ∈ E and vertices x ∈ V , θ(x) ∈ θ(v)θ(w) implies that x = v or x = w, where ab denotes the line-segment with endpoints a and b. That is, a grid drawing of a graph represents each vertex by a distinct gridpoint in the plane, and each e...
متن کاملA note on [k, l]-sparse graphs
In this note we provide a Henneberg-type constructive characterization theorem of [k, l]-sparse graphs, that is, the graphs for which the number of induced edges in any subset X of nodes is at most k|X| − l. We consider the case 0 ≤ l ≤ k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Computer Science
سال: 2020
ISSN: 2008-949X
DOI: 10.22436/jmcs.021.03.03